منابع مشابه
Permutations fixing a k - set
Let k, n be integers with 1 6 k 6 n/2 and select a permutation π ∈ Sn, that is to say a permutation of {1, . . . , n}, at random. What is i(n, k), the probability that π fixes some set of size k? Equivalently, what is the probability that the cycle decomposition of π contains disjoint cycles with lengths summing to k? Somewhat surprisingly, i(n, k) has only recently been at all well understood ...
متن کاملPermutations with given peak set
Let Sn denote the symmetric group of all permutations π = a1 . . . an of {1, . . . , n}. An index i is a peak of π if ai−1 < ai > ai+1 and we let P (π) be the set of peaks of π. Given any set S of positive integers we define P (S;n) to be the set π ∈ Sn with P (π) = S. Our main result is that for all fixed subsets of positive integers S and all sufficiently large n we have #P (S;n) = p(n)2n−#S−...
متن کاملBreaking and Fixing Private Set Intersection Protocols
A private set intersection protocol consists of two parties, a Sender and a Receiver, each with a secret input set. The protocol aims to have the Receiver output an intersection of the two sets while keeping the elements in the sets secret. This thesis thoroughly analyzes four recently published set intersection protocols, where it explains each protocol and checks whether it satisfies its corr...
متن کاملGenerating Functions for Permutations which Contain a Given Descent Set
A large number of generating functions for permutation statistics can be obtained by applying homomorphisms to simple symmetric function identities. In particular, a large number of generating functions involving the number of descents of a permutation σ, des(σ), arise in this way. For any given finite set S of positive integers, we develop a method to produce similar generating functions for t...
متن کاملSet Systems and Families of Permutations with Small Traces
We study the maximum size of a set system on n elements whose trace on any b elements has size at most k. This question extends to hypergraphs the classical Dirac-type problems from extremal graph theory. We show that if for some b ≥ i ≥ 0 the shatter function fR of a set system ([n], R) satisfies fR(b) < 2 (b − i + 1) then |R| = O(n); this generalizes Sauer’s Lemma on the size of set systems w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2015
ISSN: 1073-7928,1687-0247
DOI: 10.1093/imrn/rnv371